BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs
نویسندگان
چکیده
Antonio Alonso-Ayuso1, Laureano F. Escudero2,∗ and M. Teresa Ortuño3 Escuela Sup. de Ciencias Experimentales y Tecnoloǵıa Universidad Rey Juan Carlos, Móstoles (Madrid), Spain e-mail: [email protected] Centro de Investigación Operativa Universidad Miguel Hernández, Elche, (Alicante), Spain. e-mail: [email protected] Depto. de Estad́ıstica e Investigación Operativa I Universidad Complutense de Madrid, Spain e-mail: [email protected]
منابع مشابه
A two-stage stochastic integer programming approach as a mixture of Branch-and-Fix Coordination and Benders Decomposition schemes
We present an algorithmic approach for solving two-stage stochastic mixed 0-1 problems. The first stage constraints of the Deterministic Equivalent Model have 0–1 variables and continuous variables. The approach uses the Twin Node Family (TNF) concept within the algorithmic framework so-called Branch-and-Fix Coordination for satisfying the nonanticipativity constraints, jointly with a Benders D...
متن کاملAn Approach for Strategic Supply Chain Planning under Uncertainty based on Stochastic 0-1 Programming
We present a two-stage stochastic 0-1 modeling and a related algorithmic approach for Supply Chain Management under uncertainty, whose goal consists of determining the production topology, plant sizing, product selection, product allocation among plants and vendor selection for raw materials. The objective is the maximization of the expected benefit given by the product net profit over the time...
متن کاملA parallel Branch-and-Fix Coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems
A parallel matheuristic algorithm is presented as a spin-off from the exact Branch-and-Fix Coordination (BFC) algorithm for solving multistage stochastic mixed 0-1 problems. Some steps to guarantee the solution’s optimality are relaxed in the BFC algorithm, such that an incomplete backward branching scheme is considered for solving large sized problems. Additionally, a new branching criterion i...
متن کاملOn a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the constraint matrix and the right-hand side. The problem has the following form: given a set of operations to be executed along a time horizon, find a schedule to minimize a function included by the expected operations cos...
متن کاملAn Algorithm for Two-Stage Stochastic Quadratic Problems
An algorithm for solving quadratic, two-stage stochastic problems is developed. The algorithm is based on the framework of the Branch and Fix Coordination (BFC) method. These problems have continuous and binary variables in the first stage and only continuous variables in the second one. The objective function is quadratic and the constraints are linear. The nonanticipativity constraints are fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 151 شماره
صفحات -
تاریخ انتشار 2003